petersen graph meaning in Chinese
佩特森图
Examples
- 2 . a > regular ^ - connected graphs , generalized petersen graphs and permutation graphs are studied extensively in the design of networks
研究了k -正则k -连通图、广义petersen图和置换图的宽直径。 - Petersen graph is well known in graph theory , a generalized petersen graph , denoted by f ( m , a ) , is defined as follows : its vertex set is u u w , where u - { < / 0 . ? , ? ? ? um - i ] , w ? [ w0 , wi , ? ? ? wm - i } , its edges are given by ( u ; , wi ) , ( ui
Petersen图是图论中我们熟知的图，广义petersen图，记为p ( m ， a ) ，是有2m个顶点的图，其顶点集为，边有点对和给出，这里下标的运算都是在模m下的运算 - It invests all 3 - regular graphs with order at most 18 , all 3 - regular generalized petersen graphs with order at most 30 , all 3 - regular graphs with maximum girth and order from 20 to 30 , some random 3 - regular graphs with order from 20 to 30 , and all circulant graphs cn ( l , k ) with order at most 18 . in this article , it is shown that the average crossing number of 3 - regular graphs with biggest girth and order n ( 18 ) is greater than that of all 3 - regular graphs
通过研究n 15的所有三正则的广义petersen图p ( n ， k ) ， n 18的所有三正则图， 20 n 30的随机三正则图与具有最大围长的三正则图， n 18的所有循环图c _ n ( 1 ， k ) ，本文得到如下规律：对于给定的顶点数n ( n 18 ) ，具有最大围长的三正则图的平均交叉数大于所有三正则图的平均交叉数。